line-symmetric graph

См. также в других словарях:

• Semi-symmetric graph — In mathematics, a semi symmetric graph is an undirected graph that is edge transitive and regular, but not vertex transitive.In other words, a graph is semi symmetric if each vertex has the same number of incident edges, and there is a symmetry… …   Wikipedia

• Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

• Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia

• Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 …   Wikipedia

• Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

• Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 …   Wikipedia

• Gray graph — infobox graph name = Gray graph image caption = namesake = Marion Cameron Gray vertices = 54 edges = 81 girth = 8 chromatic number = 2 chromatic index = 3 properties = Cubic Semi symmetricIn mathematics, the Gray graph is an undirected bipartite… …   Wikipedia

• Möbius–Kantor graph — Named after August Ferdinand Möbius and S. Kantor Vertices 16 …   Wikipedia

• Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… …   Wikipedia

• Geometric graph theory — In mathematics, a geometric graph is a graph in which the vertices or edges are associated with geometric objects or configurations. Geometric graph theory is a specialization of graph theory that studies geometric graphs. Notable geometric… …   Wikipedia

• Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular …   Wikipedia